FINDING SMALL EQUIVALENT DECISION TREES IS HARD
نویسندگان
چکیده
منابع مشابه
Minimization of Decision Trees Is Hard to Approximate
Decision trees are representations of discrete functions with widespread applications in, e.g., complexity theory and data mining and exploration. In these areas it is important to obtain decision trees of small size. The minimization problem for decision trees is known to be NP-hard. In this paper the problem is shown to be even hard to approximate up to any constant factor.
متن کاملFinding Small Triangulations of Polytope Boundaries Is Hard
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal triangulation of such a 3-ball. A lifting argument is used to transfer the result also to triangulations of boundaries of 4-polytopes. The proof is constructive and translates a variant of the 3-SAT problem into an instanc...
متن کاملFinding Small OBDDs for Incompletely Specified Truth Tables Is Hard
We present an efficient reduction mapping undirected graphs G with n = 2 vertices for integers k to tables of partially specified Boolean functions g : {0, 1} → {0, 1,⊥} so that for any integer m, G has a vertex colouring using m colours if and only if g has a consistent ordered binary decision diagram with at most (2m+2)n +4n decision nodes. From this it follows that the problem of finding a m...
متن کاملContext Maximizing : Finding MDL Decision Trees
We present an application of the context weighting algorithm. Our objective is to classify objects with decision trees. The best tree will be searched for with the Minimum Description Length Principle. In order to find these trees, we modified the context weighting algorithm.
متن کاملFinding Large Clique Minors is Hard
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor. Submitted: June 2008 Reviewed: April 2009 Revised: May 2009 Accepted: July 2009 Final: July 2009 Published: July 2008 Article type: Concise paper Communicated by: G. Liotta Research supported in part by NSF grant 0830403 and by the Office of Naval Research under gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2000
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054100000193